On the solution of NP-hard linear complementarity problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on the Numerical Solution of Certain Linear Complementarity Problems

In a recent paper, J. K. Aitchison and N. K. Upton have proposed a mathematical model of the behaviour of a cloud formed immediately after the sudden release of a pollutant, together with an algorithm for determining numerical solutions of the resulting system of constrained nonlinear equations and complementarity relations. This algorithm requires, at each step, the solution of a special Linea...

متن کامل

On the optimal solution of interval linear complementarity problems

We consider compact intervals [a, a] := {x ∈ IR : a ≤ x ≤ a} and denote the set of all such intervals by IR. We also write [a] instead of [a, a]. Furthermore, we consider matrices with an interval in each of its elements; i.e., [A,A] = ([aij ]) = ([aij , aij ]). We also write [A,A] := {A ∈ IRn×n : A ≤ A ≤ A}. By IRn×n we denote the set of all these so-called interval matrices. We also write [A]...

متن کامل

Linear Problem Kernels for NP-Hard Problems on Planar Graphs

We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for Connected Vertex Cover, Minimum Edge Dominating Set,Maximum Triangle Packing, and Efficient Dominating Set on planar graphs. On the route to these results, we present e...

متن کامل

On the equivalence of linear complementarity problems

We show that the Extended Linear Complementarity Problem (ELCP) can be recast as a standard Linear Complementarity Problem (LCP) provided that the surplus variables or the feasible set of the ELCP are bounded. Since many extensions of the LCP are special cases of the ELCP, this implies that these extensions can be rewritten as an LCP as well. Our equivalence proof is constructive and leads to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Top

سال: 2002

ISSN: 1134-5764,1863-8279

DOI: 10.1007/bf02578944